Bayesian Games on a Maxmin Network Router
نویسندگان
چکیده
In this paper, we consider network games with incomplete information. In particular, we apply a game-theoretic network model to analyze Bayesian games on a MaxMin router. The results show that the MaxMin mechanism induces desirable Nash equilibria.
منابع مشابه
Robust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملDesign of a Low-Latency Router Based on Virtual Output Queuing and Bypass Channels for Wireless Network-on-Chip
Wireless network-on-chip (WiNoC) is considered as a novel approach for designing future multi-core systems. In WiNoCs, wireless routers (WRs) utilize high-bandwidth wireless links to reduce the transmission delay between the long distance nodes. When the network traffic loads increase, a large number of packets will be sent into the wired and wireless links and can...
متن کاملRepeated Games with Bounded Entropy
We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of the maximizer’s strategies while the other player is unrestricted. We will show that if the Ž . bound h n , a function of the number of repetitions n, satisfies the condition Ž . Ž . nŽ Ž .. Ž .Ž . h n rn a g n a ` , then the maxmin value W h n converges to ...
متن کاملA Neo2 Bayesian Foundation of the Maxmin Value for Two-Person Zero-Sum Games'
A joint derivation of utility and value for two-person zero-sum games is obtained using a decision theoretic approach. Acts map states to consequences. The latter are lotteries over prizes, and the set of states is a product of two finite sets (m rows and n columns). Preferences over acts are complete, transitive, continuous, monotonic and certainty-independent (Gilboa and Schmeidler (1989», an...
متن کاملCombining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games
Extensive-form games with imperfect recall are an important model of dynamic games where the players are allowed to forget previously known information. Often, imperfect recall games are the result of an abstraction algorithm that simplifies a large game with perfect recall. Unfortunately, solving an imperfect recall game has fundamental problems since a Nash equilibrium does not have to exist....
متن کامل